The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
نویسندگان
چکیده
منابع مشابه
The Forcing Edge-to-vertex Detour Number of a Graph
For two vertices u and v in a graph G = (V, E), the detour distance D (u, v) is the length of a longest u – v path in G. A u – v path of length D (u, v) is called a u – v detour. For subsets A and B of V, the detour distance D (A, B) is defined as D (A, B) = min {D (x, y) : x ∈ A, y ∈ B}. A u – v path of length D (A, B) is called an A – B detour joining the sets A, B V where u ∈ A and v ∈ B. A...
متن کاملEdge-to-vertex Detour Monophonic Number of a Graph
For a connected graph G = (V,E) of order at least three, the monophonic distance dm(u, v) is the length of a longest u− v monophonic path in G. For subsets A and B of V , the monophonic distance dm(A,B) is defined as dm(A,B) = min{dm(x, y) : x ∈ A, y ∈ B}. A u− v path of length dm(A,B) is called an A−B detour monophonic path joining the sets A,B ⊆ V, where u ∈ A and v ∈ B. A set S ⊆ E is called...
متن کاملLinear Vertex Arboricity, Independence Number and Clique Cover Number
The linear vertex-arboricity of a graph G is defined to the minimum number of subsets into which the vertex-set G can be partitioned so that every subset induces a linear forest. In this paper, we give the upper and lower bounds for sum and product of linear vertex-arboricity with independence number and with clique cover number respectively. All of these bounds are sharp.
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.04.009